Reliable shop floor bottleneck detection for flow lines through process and inventory observations: the bottleneck walk
نویسندگان
چکیده
Bottleneck detection in manufacturing is the key to improving production efficiency and stability in order to improve capacity. Yet common bottleneck detection methods in industry and academia lack either accuracy or practicability, or both, for dynamic systems. The new methodology is conducted by the observation of processes and inventories. Blocked processes and full inventories indicate a downstream bottleneck. Starved processes and empty inventories indicate an upstream bottleneck. Through subsequent observations of multiple process states and inventory levels within a system, it is possible to determine the direction of the bottleneck at the given time and hence to find the momentary bottleneck in the system. The shifting of bottlenecks can be observed directly. Work-sampling techniques can be used to obtain a long-term picture of the dynamically shifting bottleneck. The new methodology does not require any calculations, statistics, or time measurements. Hence the method is suited for practical use by shop floor supervisors and clerks. The direct observation of the bottleneck also gives additional information about the underlying causes of the bottlenecks, simplifying the improvement of the system capacity. Extensive field testing of the method received positive feedback not only from management but also shop floor operators. The method is already in use at the Robert Bosch GmbH, where it is known as the bottleneck walk. © 2014 The Authors. Published by Elsevier B.V. Selection and peer-review under responsibility of the International Scientific Committee of “RoMaC 2014” in the person of the Conference Chair Prof. Dr.-Ing. Katja Windt.
منابع مشابه
Solving the Dynamic Job Shop Scheduling Problem using Bottleneck and Intelligent Agents based on Genetic Algorithm
The problem of Dynamic Job Shop (DJS) scheduling is one of the most complex problems of machine scheduling. This problem is one of NP-Hard problems for solving which numerous heuristic and metaheuristic methods have so far been presented. Genetic Algorithms (GA) are one of these methods which are successfully applied to these problems. In these approaches, of course, better quality of solutions...
متن کاملImproving for Drum_Buffer_Rope material flow management with attention to second bottlenecks and free goods in a job shop environment
Drum–Buffer–Rope is a theory of constraints production planning methodology that operates by developing a schedule for the system’s first bottleneck. The first bottleneck is the bottleneck with the highest utilization. In the theory of constraints, any job that is not processed at the first bottleneck is referred to as a free good. Free goods do not use capacity at the first bottleneck, so very...
متن کاملDirection of the Bottleneck in Dependence on Inventory Levels
Buffers decouple fluctuations in the material flow. It is common wisdom in industry that a full buffer indicates a downstream bottleneck and an empty buffer indicates an upstream bottleneck. Numerous different bottleneck detection methods use this approach to detect the bottlenecks. However, so far this common wisdom on the shop floor has not yet been verified academically. The authors tested t...
متن کاملAn Efficient Approach for Bottleneck Resource(s) Detection Problem in the Multi-objective Dynamic Job Shop Environments
Nowadays energy saving is one of the crucial aspects in decisions. One of the approaches in this case is efficient use of resources in the industrial systems. Studies in real manufacturing systems indicating that one or more machines may also act as the Bottleneck Resource/ Resources (BR). On the other hand according to the Theory of Constraints (TOC), the efficient use of resources in manufact...
متن کاملSolving Re-entrant No-wait Flow Shop Scheduling Problem
In this study, we consider the production environment of no-wait reentrant flow shop with the objective of minimizing makespan of the jobs. In a reentrant flow shop, at least one job should visit at least one of the machines more than once. In a no-wait flowshop scheduling problem, when the process of a specific job begins on the first machine, it should constantly be processed without waiting ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Logistics Research
دوره 8 شماره
صفحات -
تاریخ انتشار 2015